A chain rule for nonsmooth composite functions via minimisation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Class of Nonsmooth Composite Functions

We discuss in this paper a class of nonsmooth functions which can be represented, in a neighborhood of a considered point, as a composition of a positively homogeneous convex function and a smooth mapping which maps the considered point into the null vector. We argue that this is a sufficiently rich class of functions and that such functions have various properties useful for purposes of optimi...

متن کامل

Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality

‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...

متن کامل

A Chain Rule for Matrix Functions and Applications

Let f be a not necessarily analytic function and let A(t) be a family of n n matrices depending on the parameter t. Conditions for the existence of the rst and higher derivatives of f(A(t)) are presented together with formulae that represent these derivatives as a submatrix of f(B) where B is a larger block Toeplitz matrix. This block matrix representation of the rst derivative is shown to be u...

متن کامل

A quasisecant method for minimizing nonsmooth functions

In this paper a new algorithm to locally minimize nonsmooth, nonconvex functions is developed. We introduce the notion of secants and quasisecants for nonsmooth functions. The quasisecants are applied to find descent directions of locally Lipschitz functions. We design a minimization algorithm which uses quasisecants to find descent directions. We prove that this algorithm converges to Clarke s...

متن کامل

Automatic Directional Differentiationof Nonsmooth Composite

We consider continuous functions that are deened by programs for their evaluation. The basic arithmetic operations and univariate special functions are real analytic in the interior of their domains. However , another frequent ingredient, the absolute value function, has a kink at the origin, which occurs similarly for max and min. A slightly more serious complication arises with the introducti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1994

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700016178